Non-planar elliptic vertex

نویسندگان

چکیده

We consider the problem of obtaining higher order in regularization parameter $\epsilon$ analytical results for master integrals with elliptics. The two commonly employed methods are provided by use differential equations and direct integration parametric representations terms iterated integrals. Taking non-planar elliptic vertex as an example we show that addition to mentioned one can solution power series. Moreover, last case it is possible obtain exact expressible either generalized hypergeometric or Kamp\'e de F\'eriet functions

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Planar Elliptic Growth

The planar elliptic extension of the Laplacian growth is, after a proper parametrization, given in a form of a solution to the equation for areapreserving diffeomorphisms. The infinite set of conservation laws associated with such elliptic growth is interpreted in terms of potential theory, and the relations between two major forms of the elliptic growth are analyzed. The constants of integrati...

متن کامل

Vertex Degrees in Planar Maps

We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers D. We also discuss the possible extension to maps of higher genus.

متن کامل

Vertex Degrees in Planar Graphs

For a planar graph on n vertices we determine the maximum values for the following: 1) the sum of the m largest vertex degrees. 2) the number of vertices of degree at least k. 3) the sum of the degrees of vertices with degree at least k.

متن کامل

vertex centered crossing number for maximal planar graph

the crossing number of a graph  is the minimum number of edge crossings over all possible drawings of  in a plane. the crossing number is an important measure of the non-planarity of a graph, with applications in discrete and computational geometry and vlsi circuit design. in this paper we introduce vertex centered crossing number and study the same for maximal planar graph.

متن کامل

Elliptic genus and vertex operator algebras

were also studied in [47]. It was conjectured in [47] that all these elliptic operators are rigid, generalizing the famous vanishing theorem of Atiyah-Hirzebruch for the Â-genus. There were several rather interesting proofs of these Witten’s conjectures (see [46], [8], [38], [41]). The one relevant to this paper is the proof given in [38], [39] where the main idea was to use the modular invaria...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of High Energy Physics

سال: 2022

ISSN: ['1127-2236', '1126-6708', '1029-8479']

DOI: https://doi.org/10.1007/jhep04(2022)045